On modal extensions of Product fuzzy logic
نویسندگان
چکیده
In this paper we study modal extensions of Product fuzzy logic with both relational semantics based on Kripke structures with crisp accessibility relations and algebraic semantics, when the underlying product fuzzy logic is expanded with truth-constants, the ∆ operator and with two infinitary inference rules. We provide completeness results for both kinds of semantics. Finally, we also consider a generalization of possibilistic logic evaluated over product algebras.
منابع مشابه
About Strong Standard Completeness of Product Logic
Propositional Product Logic is known to be standard finite-strong complete but not a strong complete, that is, it is complete for deductions only from finite sets of premises with respect to evaluations on the standard product chain over the real unit interval. On the other hand, Montagna has defined a logical system, an axiomatic extension of the Hájek’s Basic Fuzzy Logic BL with an storage op...
متن کاملExploring Extensions of Possibilistic Logic over Gödel Logic
In this paper we present completeness results of several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. In a first attempt, based on different characterizations of necessity measures on fuzzy sets, a group of logics, with Kripke style semantics, are built over a restricted language, indeed a two level language compose...
متن کاملOn the compactness property of extensions of first-order G"{o}del logic
We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملExtensions to Description Logics
This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework, but considered important for using Description Logics as a modeling language. In particular, it addresses the extensions concerning: concrete domain constraints; modal, epistemic, and temporal operators; probabilities and fuzzy logic; and defaults. On the other hand, it co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 27 شماره
صفحات -
تاریخ انتشار 2017